Sensitive Ant Model for Combinatorial Optimization
نویسنده
چکیده
A combinatorial optimization metaheuristic called Sensitive Ant Model (SAM) based on the Ant Colony System (ACS) technique is proposed. ACS agents cooperate indirectly using pheromone trails. SAM improves and extends the ACS approach by enhancing each agent of the model with properties that induce heterogeneity. Agents are endowed with different pheromone sensitivity levels. Highly-sensitive agents are essentially influenced in the decision making process by stigmergic information and thus likely to select strong pheromone-marked moves. Search intensification can be therefore sustained. Agents with low sensitivity are biased towards random search inducing diversity for exploration of the environment. SAM is studied on a dynamic optimization problem. Numerical experiments offer promising results indicating the potential of the proposed SAM metaheuristic. Key–Words: Ant systems, Metaheuristics, Stigmergy, Sensitivity, Heterogeneous system LATEX
منابع مشابه
Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملSensitive Ant Systems in Combinatorial Optimization
A new model based on the robust Ant Colony System (ACS) is introduced. The proposed Sensitive ACS (SACS) model extends ACS using the sensitive reaction of ants to pheromone trails. Each ant is endowed with a pheromone sensitivity level allowing different types of responses to pheromone trails. The SACS model facilitates a good balance between search exploitation and search exploration. Both ACS...
متن کاملSensitive Ants in Solving the Generalized Vehicle Routing Problem
The idea of sensitivity in ant colony systems has been exploited in hybrid ant-based models with promising results for many combinatorial optimization problems. Heterogeneity is induced in the ant population by endowing individual ants with a certain level of sensitivity to the pheromone trail. The variable pheromone sensitivity within the same population of ants can potentially intensify the s...
متن کاملModel-based Search for Combinatorial Optimization
In this paper we introduce model-based search as a unifying framework accommodating some recently proposed heuristics for combinatorial optimization such as ant colony optimization, stochastic gradient ascent, cross-entropy and estimation of distribution methods. We discuss similarities as well as distinctive features of each method and we propose some extensions.
متن کاملParallel Ant Colonies for Combinatorial Optimization Problems
Ant Colonies (AC) optimization take inspiration from the behavior of real ant colonies to solve optimization problems. This paper presents a parallel model for ant colonies to solve the quadratic assignment problem (QAP). Parallelism demonstrates that cooperation between communicating agents improve the obtained results in solving the QAP. It demonstrates also that high-performance computing is...
متن کامل